Papers with ranking methods
Unsupervised Contrast-Consistent Ranking with Language Models (2024.eacl-long)
Copied to clipboard
| Challenge: | Language models contain ranking-based knowledge and are powerful solvers of in-context ranking tasks. |
| Approach: | They propose to use a model to elicit language models' ranking knowledge without supervision by using a pairwise, pointwise and listwise prompting method. |
| Outcome: | The proposed method is inspired by an unsupervised probing method called Contrast-Consistent Search (CCS). |
RAMQA: A Unified Framework for Retrieval-Augmented Multi-Modal Question Answering (2025.findings-naacl)
Copied to clipboard
| Challenge: | Existing ranking methods rely on small encoder-based ranking models, which are incompatible with modern decoder--based generative large language models (LLMs) Existing methods based on small LLaVA rankers are incompatible with advanced LLMs. |
| Approach: | They propose a framework that combines learning-to-rank methods with generative permutation-enhanced ranking techniques. |
| Outcome: | The proposed framework improves on two benchmarks, WebQA and MultiModalQA, showing significant improvements over baselines. |
Uni-Encoder: A Fast and Accurate Response Selection Paradigm for Generation-Based Dialogue Systems (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing approaches to decode a given context-candidate pair are expensive and time-consuming. |
| Approach: | They propose a new paradigm that keeps full attention over each pair while only encoding the context once. |
| Outcome: | The proposed paradigm achieves new state-of-the-art results on four benchmark datasets with high computational efficiency. |
To Share or not to Share: Predicting Sets of Sources for Model Transfer Learning (2021.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods to select transfer sources are limited by text and task similarity, which limits their application in transfer settings where both the task and the text domain change. |
| Approach: | They propose a model similarity measure that represents text and task similarity jointly to automatically determine which and how many sources to exploit. |
| Outcome: | The proposed approach improves performance by 24 F1 points for predicting promising sources across domains and tasks with similar models. |
Ranking Reasoning LLMs under Test-Time Scaling (2026.acl-long)
Copied to clipboard
| Challenge: | Large language models (LLMs) are increasingly used as general-purpose reasoning systems for tasks such as programming and mathematical problem solving. |
| Approach: | They formalize dense benchmark ranking under test-time scaling and introduce a library that implements statistical ranking methods such as paired-comparison models, item response theory, voting rules, graph- and spectral-based methods. |
| Outcome: | The proposed method is based on paired-comparison models, item response theory (IRT) models, voting rules, graph- and spectral-based methods. |